package test2.recursion;

public class Solution {
    public int fib(int N) {
        // 在此处写入代码

        if (N == 0) {
            return 0;
        }
        if (N == 1) {
            return 1;
        }
        return fib(N - 1) + fib(N - 2);
    }
}
